Time-Trimming Tricks for Dynamic Simulations
نویسندگان
چکیده
منابع مشابه
Time-Trimming Tricks for Dynamic Ways & Means Simulations: Splitting Force Updates to Reduce Computational Work
of balancing a larger step size with lower resolution As one of the largest group of supercomputer consumaccuracy. That is, with decreased intervals of molecular ers, macromolecular modelers are always scrambling observations (force update frequency), the resolution of for more computer time. With the goal of gaining insights some fast processes might have to be sacrificed. Aninto a variety of ...
متن کاملTrimming the Multipath for Efficient Dynamic Routing
Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do so to load balance the network. In this paper, we consider multipath routing with only a limited number of end-to-end paths for each source and destination,...
متن کاملDecoupling Kinematic Loops for Real-Time Multibody Dynamic Simulations
Earth moving equipment are typically equipped with hydraulic cylinder actuators to perform the designated tasks. Multibody modelling of such systems results in models with kinematic loops that couples the motion variables of the loop bodies. Iterative solutions will be needed to satisfy the loop constraints and the applied constraints, which require evaluation of the constraint Jacobean matrix....
متن کاملParareal in Time for Dynamic Simulations of Power Systems
In recent years, there have been significant developments in parallel algorithms and high performance parallel computing platforms. Parareal in time algorithm has become popular for long transient simulations (e.g., molecular dynamics, fusion, reacting flows). Parareal is a parallel algorithm which divides the time interval into sub-intervals and solves them concurrently. This paper investigate...
متن کاملA Dynamic Programming Algorithm for Tree Trimming-based Text Summarization
Tree trimming is the problem of extracting an optimal subtree from an input tree, and sentence extraction and sentence compression methods can be formulated and solved as tree trimming problems. Previous approaches require integer linear programming (ILP) solvers to obtain exact solutions. The problem of this approach is that ILP solvers are black-boxes and have no theoretical guarantee as to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structure
سال: 2001
ISSN: 0969-2126
DOI: 10.1016/s0969-2126(01)00593-7